1. The shortest amount of time that could be required to complete the activity assuming that everything goes very well is known as
2. Estimating expected activity times in a PERT network
3. Which of these is not correct
4. Which of the following is not correct in respect of PERT calculations?
5. The greatest amount of time that could be required to complete the activity if everything goes wrong is known as
6. CPM stands for
7. There are four possible types of float but in practice only three of these are used.Which one of the following is not one of these?
8. If value of total float for any activityis equal to zero, then one can draw conclusion thatresources are
9. Mark the wrong statement.
10. The longest path in the CPM network is called the
11. To disconnect an activity before the completion of all activities in a network diagram is known
12. Point out what is not required, while considering precedence relationships
13. Which of the following is not a rule of network construction?
14. Mark the wrong statement
15. A standard procedure called i-jrule for convenience labeling on a network diagram wasdeveloped by
16. The OR techniques used for planning, scheduling and controlling large and complex projects are known as
17. An activity requires for its completion
18. An event represents a point in time signifying the
19. Activities which cannot be started until one or more of other activities are completed but immediately succeed them are called
20. An activity which does not consume any kind of resources but merely depicts the technological dependence is called
21. If customer arrives at known intervals and the service time is known with certainty, the nature of queuing model will be
22. If the arrivals are completely random, then the probability distribution of number of arrivalsin a fixed time interval follows
23. (M/M/1): (?/FIFO) indicates a queuing system when
24. The unit of traffic intensity is
25. Average number of customers in (M/M/1):(¥/FIFO) queuing system is given by:
26. One of the oldest and most widely used Operations Research techniques to study the waiting lines iscalled
27. The queuing theory owes its development to
28. The rule to determine the formation of queue and manner in which customers form the queue are selected for service is called
29. Customers who switch from one queue to another hoping to receive service more quickly are said to be
30. In service discipline if the customers are served in the order of their arrival, then this is known as the
31. The procedure to solve sequencing problem with n jobs through two machines was given by
32. Every sequencing problem must have
33. In sequencing problem, we select the sequences for which the total time taken in processing all the jobs on the machines would be
34. In sequencing problem processing of n jobs through three machines A, B and C in the order ABC is also considered when the
35. In Johnsons procedure to solve n jobs though two machines, find the minimum processing time from all the jobs, do the job first if
36. The assignment of the order in which jobs are processed is known as
37. In sequencing problem , the effectiveness is a function of
38. Theoretically all possible sequence with n jobs and m machines is given by
39. Total elapsed time is the time between starting the first job and completing the last job in a particular order by the given set of machines include
40. Which of the following statement is not a basic assumption of sequencing problem
41. Replacement theory deals with the analysis of materials and machines which deteriorate with time and fix the optimal time of their replacement so that total cost is
42. Optimal policy for replacement of items whose maintenance costs increase with time; while the value of money remains same during the period is given by:
43. The present worth factor with regard to replacement and maintenance models, is given by:
44. The present worth factor of unit amount to be spent after one year is given by
45. Optimal policy for replacement of items whose maintenance costs increase with time; while the value of money changes with constant rate during the period is given by:
46. Replacement is concerned with situations arising due to their
47. The type of failure in which the probability of failure increases with the increase in the life of an item is
48. Slow or progressive failure as the life of the item increases , its efficiency decreases is known as
49. When the items do not deteriorate markedly with service but which ultimately fail after a period of use is known as
50. Mark the wrong statement regarding assumptions which are made while deciding about the replacement decisions
51. In decision making , the OR study helps to have
52. The term Operations Research was first coined in 1940 by
53. Operations Researchapproach is
54. In India, Operations Research came into existence in 1949 with the opening of an OR unit at
55. The creative ability of a decision maker using OR
56. A model is
57. Models which assume conditions of complete certainty and perfect knowledge are known as
58. Which of the following is not general method of deriving the solution
59. The model which does not consider the impact of changes that takes place during the planning horizon is a
60. The first step in methodology of Operations Research comprises
61. The first step in formulating a linear programming problem is
62. Whenever, a constraint does not define a portion of the boundary of the feasible solution region, it is called
63. The maximum value of P=6X+11Y, subject to the constraints 2X+Y?104, X+2Y?76, X?0,Y ?0 is
64. The optimal value of the objective function is attained at the points
65. In general LPP the function which optimizes a linear function of variables subject to a set of linear equations and/or inequations is known as
66. In LP problem having only less than or equal to constraints the initial basic feasible solution is provided by using
67. In Simplex Method ,variable with non-zero values are called
68. Simplex Method in LP is
69. The positive variable which is subtracted from the left hand side of the constraint to convert it into equation is called
70. The element at the intersection of minimum ratio arrow and incoming vector arrow is called
71. Transportation problem arises in situations involving
72. In transportation problem where supply and demand are exactly equal is known as
73. In a transportation problem having m origins and n destinations then the problem is solvable if number of basic variables are
74.
In a Transportation problem the objective is to transport various quantities of a single homogenous commodity that are stored at various origins to different destinations in such a way that the transportation cost is
75. Transportation problem is an important class of
76. In which method an algorithm is used to find a relatively efficient initial feasible solution to a transportationproblem
77. Systematic allocation to cells beginning in the upper left hand corner of the transportation problem to obtain an initial feasible solution is
78. In Vogels Approximation Method, the penalty (opportunity cost) associated witha row is determined by
79. In transportation problem a feasible solution to a 6 origin, 5 destination problem is said to be basic if the number of positive allocations are
80. Rim conditionsin a transportation problem means
81. Modified Distribution Method is used to solve
82. The MODI method uses the stepping stone path
83.
If the feasible solution of a transportation problem with m origins and n destinations is equal tom+n-1 then solution oftransportation problemis said to be
84.
The most convenient way to deal with the maximization in a transportation problem is to transform the profits to relative costs
85. If the feasible solution of a transportation problem with m origins and n destinations is fewer than m+n-1 then solution oftransportation problemis said to be
86. The problem which involves the allocation of n different facilities to n different tasks is often termed as
87. Which of the following is true for assignment problem
88. Assignment problem is special class of
89. If the assignment problem involves maximization, convert the effective matrix to an opportunities loss matrix by
90. In an assignment problem, if we add or subtract a constant to every element of any row (or column) of the cost matrix [Cij], then an assignment that minimizes the total cost on one matrix also
91. Hungarian Method is a technique of solving
92. An efficient means of finding the optimal solution of assignment problem is
93. The drawback to use the transportation method in solvingan assignment problem is that :
94. In assignment problem if the minimum number of lines covering all the zeros is smaller than n, then the least uncovered value
95. Hungarian method of assignment problem was developed by
96. Holding Cost is assumed to be varying directly the as well as the
97. Thepenalty costs that are incurred as a result of either delay in meeting the demand or inability to meet it at all due to running out of stock are known as
98. Which of the following would not generally be a motive for a firm to hold inventories?
99. The fixed cost associated with obtaining goods to pressing of an order or purchasing or manufacturing or setting up of a machine before start of production is known as
100. Which of the following is not correct in respect of objective of Inventory control
101. If the lead time is known and not equal to zero and if demand is deterministic then one should order in advance by an amount of time
102. EOQ is the order quantity that over our planning horizon.
103. The concept of Economic Order Quantity (EOQ) Model was developed by
104. Economic ordering quantity is that size of order which minimizes total annual cost of carrying inventory and cost of ordering under the assumed conditions of
105. In inventory model ,the ordering and the holding costs are equal at
106. CPM stands for
107. There are four possible types of float but in practice only three of these are used.Which one of the following is not one of these?
108. If value of total float for any activityis equal to zero, then one can draw conclusion thatresources are
109. Mark the wrong statement.
110. The longest path in the CPM network is called the